Selective partitioning of sets of pages programmed to memory device

ABSTRACT

A system includes a memory device having multiple of dice and a processing device operatively coupled to the memory device. The processing device performs operations including receiving memory operations to program sets of pages of data across at least a subset of the plurality of dice and identifying a plurality of the sets of pages experiencing a variation in a data state metric satisfying a threshold criterion. The operations further include partitioning, into a set of partitions, a set of pages of the plurality of the sets of pages, programming the set of partitions to the plurality of dice, and storing, in a metadata table, at least one bit to indicate that the first set of pages is partitioned.

TECHNICAL FIELD

Embodiments of the disclosure are generally related to memorysub-systems, and more specifically, are related to selectivepartitioning of sets of pages programmed to a memory device.

BACKGROUND

A memory sub-system can include one or more memory devices that storedata. The memory devices can be, for example, non-volatile memorydevices and volatile memory devices. In general, a host system canutilize a memory sub-system to store data at the memory devices and toretrieve data from the memory devices.

BRIEF DESCRIPTION OF THE DRAWINGS

The present disclosure will be understood more fully from the detaileddescription given below and from the accompanying drawings of someembodiments of the disclosure.

FIG. 1 illustrates an example computing system that includes a memorysub-system in accordance with some embodiments.

FIG. 2 is a set of graphs that illustrate a temporal voltage shiftcaused by the slow charge loss exhibited by triple-level memory cells,in accordance with some embodiments.

FIG. 3 is an example graph illustrating the dependency of a thresholdvoltage offset on the time after program, e.g., the period of timeelapsed since the a page had been programmed, in accordance with someembodiments.

FIG. 4 is a graph that illustrates a set of predefined threshold voltageoffset bins, in accordance with embodiments.

FIG. 5 is a block diagram that illustrates operation of a block familymanager within the memory sub-system controller of FIG. 1 in accordancewith various embodiments.

FIG. 6 is a graph that schematically illustrates metadata maintained bythe memory sub-system controller operating in according with someembodiments.

FIG. 7 is a flow diagram of an example method for selective partitioningof sets of pages programmed to a memory device, in accordance with someembodiments.

FIG. 8 is a flow diagram of an example method of selective partitioningof sets of pages programmed to a memory device, in accordance withanother embodiment.

FIG. 9 is a flow diagram of an example method for selective partitioningof sets of pages programmed to a memory device, according to a furtherembodiment.

FIG. 10 is a flow diagram of an example method for merging a partitionedset of pages according to an embodiment.

FIG. 11 is a block diagram of an example computer system in whichembodiments of the present disclosure can operate.

DETAILED DESCRIPTION

Embodiments of the present disclosure are directed to selectivepartitioning of sets of pages programmed to a memory device. A memorysub-system can be a storage device, a memory module, or a hybrid of astorage device and memory module. Examples of storage devices and memorymodules are described below in conjunction with FIG. 1. In general, ahost system can utilize a memory sub-system that includes one or morecomponents, such as memory devices that store data. The host system canprovide data to be stored at the memory sub-system and can request datato be retrieved from the memory sub-system.

A memory sub-system can utilize one or more memory devices, includingany combination of the different types of non-volatile memory devicesand/or volatile memory devices, to store the data provided by the hostsystem. In some embodiments, non-volatile memory devices can be providedby negative-and (NAND) type flash memory devices. Other examples ofnon-volatile memory devices are described below in conjunction withFIG. 1. A non-volatile memory device is a package of one or more dice.Each die can consist of one or more planes. Planes can be groups intologic units (LUN). For some types of non-volatile memory devices (e.g.,NAND devices), each plane consists of a set of physical blocks. A“block” herein refers to a set of contiguous or non-contiguous memorypages. An example of a block is an erasable block, which is a minimalerasable unit of memory, while a page is a minimal writable unit ofmemory. Each page includes a set of memory cells (“cells”). A cell is anelectronic circuit that stores information.

Data operations can be performed by the memory sub-system. The dataoperations can be host-initiated operations. For example, the hostsystem can initiate a data operation (e.g., write, read, erase, etc.) ona memory sub-system. The host system can send access requests (e.g.,write command, read command) to the memory sub-system, such as to storedata on a memory device at the memory sub-system and to read data fromthe memory device on the memory sub-system. The data to be read orwritten, as specified by a host request, is hereinafter referred to as“host data.” A host request can include logical address information(e.g., logical block address (LBA), namespace) for the host data, whichis the location the host system associates with the host data.

A memory device includes multiple memory cells, each of which can store,depending on the memory cell type, one or more bits of information. Amemory cell can be programmed (written to) by applying a certain voltageto the memory cell, which results in an electric charge being held bythe memory cell, thus allowing modulation of the voltage distributionsproduced by the memory cell. Moreover, precisely controlling the amountof the electric charge stored by the memory cell allows to establishmultiple threshold voltage levels corresponding to different logicallevels, thus effectively allowing a single memory cell to store multiplebits of information: a memory cell operated with 2^(n) differentthreshold voltage levels is capable of storing n bits of information ordata. “Threshold voltage” herein shall refer to the voltage level thatdefines a boundary between two neighboring voltage distributionscorresponding to two logical levels. Thus, the read operation can beperformed by comparing the measured voltage exhibited by the memory cellto one or more reference voltage levels in order to distinguish betweentwo logical levels for single-level cells and between multiple logicallevels for multi-level cells.

Due to the phenomenon known as slow charge loss, the threshold voltageof a memory cell changes in time as the electric charge of the celldegrades, which is referred to as “temporal voltage shift” (TVS), sincethe degrading electric charge causes the voltage distributions to shiftalong the voltage axis towards lower voltage levels. The thresholdvoltage is changing rapidly at first (immediately after the memory cellwas programmed), and then slows down in an approximately logarithmiclinear fashion with respect to the time elapsed since the cellprogramming event. Slow charge loss can also increase with increasingtemperature of memory cells as well as with increasing program erasecycles, among other factors.

Various common implementations, however, either fail to adequatelyaddress the TVS or employ inefficient strategies resulting in high biterror rates and/or exhibiting other shortcomings. Disclosed embodimentsaddress the above-noted and other deficiencies by implementing a memorysub-system that employs block family based error avoidance strategies,thus significantly improving the bit error rate exhibited by the memorysub-system.

According to various embodiments, the temporal voltage shift isselectively tracked for a programmed set of memory cells grouped byblock families, and appropriate voltage offsets, which are based onblock affiliation with a certain block family, are applied to the baseread levels in order to perform read operations. “Block family” hereinshall refer to a possibly non-contiguous set of memory cells (which canreside in one or more full and/or partial blocks, the latter referred toas “partitions” herein) that have been programmed within a specifiedtime window and a specified temperature window, and thus are expected toexhibit similar or correlated changes in their respective data statemetrics. A block family can be made with any granularity, containingonly whole codewords, whole pages, whole superpages, or wholesuperblocks, or any combination of these. “Data state metric” hereinshall refer to a quantity that is measured or inferred from the state ofdata stored on a memory device. Specifically, the data state metrics canreflect the state of the temporal voltage shift, the degree of readdisturb, and/or other measurable functions of the data state. Acomposite data state metric is a function (e.g., a weighted sum) of aset of component state metrics.

In creating a block family, variation in the temporal voltage shift canbe significant between beginning to program data and closure of theblock family. These effects can be magnified by inconsistent rates ofprogramming across block families and by a relatively large time afterprogram (TAP) until closing the block family. To illustrate, assumeafter 15 minutes of TAP, programmed data has a 14 millivolt (mV) shiftin temporal voltage. Further assume that after 24 hours TAP, there isvirtually no temporal voltage shift over a 15 minute window.Accordingly, by shrinking the size of a unit of trackable data inmemory, the variation in temporal voltage shift for that trackable unitcan be minimized, and thus assignment to a threshold voltage offset forperforming read operations can be more relevant, e.g., yield lower readbit error (RBER) rates, for all pages of the trackable unit of memory.

More specifically, to minimize the temporal voltage shift between thebeginning of programming and the end of programming a tracked unit ofmemory, the present embodiments partition programmed data into moregranular units of data for purposes of tracking and assignment ofthreshold voltage offsets. These more granular units of data arereferred to herein as a partition within of a set of pages of memory.Thus, the assignment of threshold voltage offsets to a block family canbe further assigned at a block family and partition level for betterRBER performance of assigned threshold voltage offsets.

In various embodiments, memory constraints, including the allocation ofmemory for storing the metadata that tracks partitions, suggest aselective approach to partitioning sets of pages. For example, thedisclosed system and methods can further identify a subset of the setsof pages experiencing a variation in a measured value for a data statemetric (such as TVS) that satisfies a threshold criterion. The systemand method can therefore partition just the sets of pages that qualifyaccording to this threshold criterion instead of partitioning each ofthe sets of pages being programmed to multiple dice of a memory device.Similarly, once a partitioned set of pages has reached a threshold TAP,the partitioning can be removed so that all pages of the set of pagesare again treated equally for purposes of assignment to a thresholdvoltage offset bin and/or to threshold voltage offset values.

Different memory allocations schemes track different granular sizes ofmemory, where a common memory allocation is for a superblock, althoughother sets of pages or superpages can be allocated at differentgranularities other than a superblock. A superblock is a set of datablocks that span multiple dice that are written in an interleavedfashion. In some cases, a superblock spans all (or at least a subset of)the dice within a memory device. A superblock can contain multiple datablocks from a single die, such as one per plane. Drives may generallymanage the erasure and programming of data on a superblock basis orother granularity of superpages. A superpage is a page programmed tomultiple dice as a lowest addressable unit of memory. For simplicity,“pages” as used herein should be understood to also make reference to“superpages” in a multi-dice system.

In various embodiments, a set of pages (e.g., a superblock, a group ofblocks, a group of superpages, or the like) is partitioned to include aset of partitions, where each partition contains a certain number ofpages, such as 18, 20, 24, 32, or the like number of pages. In oneembodiment, each partition of the set of partitions is of a fixed length(or size), and thus the set of pages would include a fixed number ofpartitions. In another embodiment, each partition of the set ofpartitions is of a variable length (or size), and thus the set of pagescould include a variable number of partitions. To limit the potentialsize of the set of pages, the partitioning can be limited to a maximumnumber of variable-length partitions.

In the various embodiments, once the set of pages is partitioned into aset of partitions, the set of partitions is programmed to the multipledice of the memory device, and each partition is associated with thesame (or a different) block family, and thus can be associated with thesame (or a different) threshold voltage offset bin. Further, at leastone bit is stored in a metadata table (or other memory tracking datastructure for mapping block family and partitioned units to thresholdvoltage offsets) to indicate that the set of pages is partitioned. Otherinformation helpful in mapping the block family and partition (whetherfixed or variable in length) to threshold voltage offsets can also bestored in one or more metadata table as will be discussed in moredetail.

Since the time elapsed after programming and temperature are the mainfactors affecting the temporal voltage shift, all blocks and/orpartitions within a single block family are presumed to exhibit similardistributions of threshold voltages in memory cells, and thus wouldrequire the same voltage offsets to be applied to the base read levelsfor read operations. “Base read level” herein shall refer to the initialthreshold voltage level exhibited by the memory cell immediately afterprogramming. In some implementations, base read levels can be stored inthe metadata of the memory device.

Upon receiving a read command, the memory sub-system controller canidentify the block family associated with the page or block identifiedby the logical block address (LBA) specified by the read operation,identify the threshold voltage offset bin associated with the blockfamily and die on which the page or block resides, compute the newthreshold voltage by additively applying the threshold voltage offsetassociated with the threshold voltage offset bin to the base read level,and perform the read operation using the new threshold voltage.

Therefore, advantages of the systems and methods implemented inaccordance with some embodiments of the present disclosure include, butare not limited to, improving the bit error rate in read operations bymaintaining metadata tracking groups of memory cells (e.g., partitionsof sets of pages associated with block families) that are presumed toexhibit similar voltage distributions and selectively performingcalibration operations for limited subsets of memory cells based ontheir block family and partition association. Further, because suchtracking, storage, and calibration are performed on a partition andblock family basis as opposed to a per-block (or per-page) basis,processing, memory, and storage resources are preserved for host systemusage. Other advantages will be apparent to those skilled in the art ofmemory allocation and error optimization within a memory sub-systemdiscussed hereinafter.

FIG. 1 illustrates an example computing system 100 that includes amemory sub-system 110 in accordance with some embodiments of the presentdisclosure. The memory sub-system 110 can include media, such as one ormore volatile memory devices (e.g., memory device 140), one or morenon-volatile memory devices (e.g., memory device 130), or a combinationof such.

A memory sub-system 110 can be a storage device, a memory module, or ahybrid of a storage device and memory module. Examples of a storagedevice include a solid-state drive (SSD), a flash drive, a universalserial bus (USB) flash drive, an embedded Multi-Media Controller (eMMC)drive, a Universal Flash Storage (UFS) drive, a secure digital (SD)card, and a hard disk drive (HDD). Examples of memory modules include adual in-line memory module (DIMM), a small outline DIMM (SO-DIMM), andvarious types of non-volatile dual in-line memory module (NVDIMM).

The computing system 100 can be a computing device such as a desktopcomputer, laptop computer, network server, mobile device, a vehicle(e.g., airplane, drone, train, automobile, or other conveyance),Internet of Things (IoT) enabled device, embedded computer (e.g., oneincluded in a vehicle, industrial equipment, or a networked commercialdevice), or such computing device that includes memory and a processingdevice (e.g., a processor).

The computing system 100 can include a host system 120 that is coupledto one or more memory sub-systems 110. In some embodiments, the hostsystem 120 is coupled to different types of memory sub-systems 110. FIG.1 illustrates one example of a host system 120 coupled to one memorysub-system 110. As used herein, “coupled to” or “coupled with” generallyrefers to a connection between components, which can be an indirectcommunicative connection or direct communicative connection (e.g.,without intervening components), whether wired or wireless, includingconnections such as electrical, optical, magnetic, etc.

The host system 120 can include a processor chipset and a software stackexecuted by the processor chipset. The processor chipset can include oneor more cores, one or more caches, a memory controller (e.g., NVDIMMcontroller), and a storage protocol controller (e.g., PCIe controller,SATA controller). The host system 120 uses the memory sub-system 110,for example, to write data to the memory sub-system 110 and read datafrom the memory sub-system 110.

The host system 120 can be coupled to the memory sub-system 110 via aphysical host interface. Examples of a physical host interface include,but are not limited to, a serial advanced technology attachment (SATA)interface, a peripheral component interconnect express (PCIe) interface,universal serial bus (USB) interface, Fibre Channel, Serial AttachedSCSI (SAS), a double data rate (DDR) memory bus, Small Computer SystemInterface (SCSI), a dual in-line memory module (DIMM) interface (e.g.,DIMM socket interface that supports Double Data Rate (DDR)), Open NANDFlash Interface (ONFI), Double Data Rate (DDR), Low Power Double DataRate (LPDDR), etc. The physical host interface can be used to transmitdata between the host system 120 and the memory sub-system 110. The hostsystem 120 can further utilize an NVM Express (NVMe) interface to accesscomponents (e.g., memory devices 130) when the memory sub-system 110 iscoupled with the host system 120 by the PCIe interface. The physicalhost interface can provide an interface for passing control, address,data, and other signals between the memory sub-system 110 and the hostsystem 120. FIG. 1 illustrates a memory sub-system 110 as an example. Ingeneral, the host system 120 can access multiple memory sub-systems viaa same communication connection, multiple separate communicationconnections, and/or a combination of communication connections.

The memory devices 130,140 can include any combination of the differenttypes of non-volatile memory devices and/or volatile memory devices. Thevolatile memory devices (e.g., memory device 140) can be, but are notlimited to, random access memory (RAM), such as dynamic random accessmemory (DRAM) and synchronous dynamic random access memory (SDRAM).

Some examples of non-volatile memory devices (e.g., memory device 130)include negative-and (NAND) type flash memory and write-in-place memory,such as a three-dimensional cross-point (“3D cross-point”) memorydevice, which is a cross-point array of non-volatile memory cells. Across-point array of non-volatile memory can perform bit storage basedon a change of bulk resistance, in conjunction with a stackablecross-gridded data access array. Additionally, in contrast to manyflash-based memories, cross-point non-volatile memory can perform awrite in-place operation, where a non-volatile memory cell can beprogrammed without the non-volatile memory cell being previously erased.NAND type flash memory includes, for example, two-dimensional NAND (2DNAND) and three-dimensional NAND (3D NAND).

Each of the memory devices 130 can include one or more arrays of memorycells. One type of memory cell, for example, single level cells (SLC)can store one bit per cell. Other types of memory cells, such asmulti-level cells (MLCs), triple level cells (TLCs), and quad-levelcells (QLCs), can store multiple bits per cell. In some embodiments,each of the memory devices 130 can include one or more arrays of memorycells such as SLCs, MLCs, TLCs, QLCs, or any combination of such. Insome embodiments, a particular memory device can include an SLC portion,and an MLC portion, a TLC portion, or a QLC portion of memory cells. Thememory cells of the memory devices 130 can be grouped as pages that canrefer to a logical unit of the memory device used to store data. Withsome types of memory (e.g., NAND), pages can be grouped to form blocks.

Although non-volatile memory devices such as 3D cross-point array ofnon-volatile memory cells and NAND type memory (e.g., 2D NAND, 3D NAND)are described, the memory device 130 can be based on any other type ofnon-volatile memory, such as read-only memory (ROM), phase change memory(PCM), self-selecting memory, other chalcogenide based memories,ferroelectric transistor random-access memory (FeTRAM), ferroelectricrandom access memory (FeRAM), magneto random access memory (MRAM), SpinTransfer Torque (STT)-MRAM, conductive bridging RAM (CBRAM), resistiverandom access memory (RRAM), oxide based RRAM (OxRAM), negative-or (NOR)flash memory, and electrically erasable programmable read-only memory(EEPROM).

A memory sub-system controller 115 (or controller 115 for simplicity)can communicate with the memory devices 130 to perform operations suchas reading data, writing data, or erasing data at the memory devices 130and other such operations. The memory sub-system controller 115 caninclude hardware such as one or more integrated circuits and/or discretecomponents, a buffer memory, or a combination thereof. The hardware caninclude digital circuitry with dedicated (i.e., hard-coded) logic toperform the operations described herein. The memory sub-systemcontroller 115 can be a microcontroller, special purpose logic circuitry(e.g., a field programmable gate array (FPGA), an application specificintegrated circuit (ASIC), etc.), or other suitable processor.

The memory sub-system controller 115 can include a processor 117 (e.g.,processing device) configured to execute instructions stored in a localmemory 119. In the illustrated example, the local memory 119 of thememory sub-system controller 115 includes an embedded memory configuredto store instructions for performing various processes, operations,logic flows, and routines that control operation of the memorysub-system 110, including handling communications between the memorysub-system 110 and the host system 120.

In some embodiments, the local memory 119 can include memory registersstoring memory pointers, fetched data, etc. The local memory 119 canalso include read-only memory (ROM) for storing micro-code. While theexample memory sub-system 110 in FIG. 1 has been illustrated asincluding the controller 115, in another embodiment of the presentdisclosure, a memory sub-system 110 does not include a controller 115,and can instead rely upon external control (e.g., provided by anexternal host, or by a processor or controller separate from the memorysub-system).

In general, the memory sub-system controller 115 can receive commands oroperations from the host system 120 and can convert the commands oroperations into instructions or appropriate commands to achieve thedesired access to the memory devices 130. The memory sub-systemcontroller 115 can be responsible for other operations such as wearleveling operations, garbage collection operations, error detection anderror-correcting code (ECC) operations, encryption operations, cachingoperations, and address translations between a logical address (e.g.,logical block address (LBA), namespace) and a physical address (e.g.,physical block address) that are associated with the memory devices 130.The memory sub-system controller 115 can further include host interfacecircuitry to communicate with the host system 120 via the physical hostinterface. The host interface circuitry can convert the commandsreceived from the host system into command instructions to access thememory devices 130 as well as convert responses associated with thememory devices 130 into information for the host system 120.

In some implementations, memory sub-system 110 can use a stripingscheme, according to which every the data payload (e.g., user data)utilizes multiple dice of the memory devices 130 (e.g., NAND type flashmemory devices), such that the payload is distributed through a subsetof dice, while the remaining one or more dice are used to store theerror correction information (e.g., parity bits). Accordingly, a set ofblocks distributed across a set of dice of a memory device using astriping scheme is referred herein to as a “superblock.”

The memory sub-system 110 can also include additional circuitry orcomponents that are not illustrated. In some embodiments, the memorysub-system 110 can include a cache or buffer (e.g., DRAM) and addresscircuitry (e.g., a row decoder and a column decoder) that can receive anaddress from the controller 115 and decode the address to access thememory devices 130.

In some embodiments, the memory devices 130 include local mediacontrollers 135 that operate in conjunction with memory sub-systemcontroller 115 to execute operations on one or more memory cells of thememory devices 130. An external controller (e.g., memory sub-systemcontroller 115) can externally manage the memory device 130 (e.g.,perform media management operations on the memory device 130). In someembodiments, a memory device 130 is a managed memory device, which is araw memory device combined with a local controller (e.g., localcontroller 135) for media management within the same memory devicepackage. An example of a managed memory device is a managed NAND (MNAND)device.

The memory sub-system 110 includes a block family manager 113 that canbe used to implement the block family-based error avoidance strategiesin accordance with embodiments of the present disclosure. In someembodiments, the controller 115 includes at least a portion of the blockfamily manager 113. For example, the controller 115 can include aprocessor 117 (processing device) configured to execute instructionsstored in local memory 119 for performing the operations describedherein. In some embodiments, the block family manager 113 is part of thehost system 120, an application, or an operating system. The blockfamily manager 113 can manage block families associated with the memorydevices 130, as described in more detail herein below.

FIG. 2 is a set of graphs that illustrate a temporal voltage shiftcaused by the slow charge loss exhibited by triple-level memory cells,in accordance with some embodiments. While the illustrative example ofFIG. 2 utilizes triple-level cells, the same observations can be madeand, accordingly, the same remedial measures are applicable to singlelevel cells and multi-level cells in order to compensate for the slowcharge loss.

As noted herein above, a memory cell can be programmed (written to) byapplying a certain voltage to the memory cell, which results in anelectric charge being held by the memory cell, thus allowing modulationof the voltage distributions produced by the memory cell. Preciselycontrolling the amount of the electric charge stored by the memory cellallows to establish multiple threshold voltage levels corresponding todifferent logical levels, thus effectively allowing a single memory cellto store multiple bits of information: a memory cell operated with 2^(n)different threshold voltage levels is capable of storing n bits ofinformation.

In FIG. 2, each graph illustrates a voltage distribution produced bymemory cells programmed by a respective write level (which can beassumed to be at the midpoint of the distribution) to encode acorresponding logical level (“000” through “111” in case of a TLC). Inorder to distinguish between neighboring distributions (corresponding totwo different logical levels), the threshold voltage levels (shown bydashed vertical lines) are defined, such that any measured voltage thatfalls below a threshold level is associated with one distribution of thepair of neighboring distributions, while any measured voltage that isgreater than or equal to the threshold level is associated with anotherdistribution of the pair of neighboring distributions.

The set of a graphs include a first graph 210 that reflects a timeperiod immediately after programming and a second graph 230 thatreflects a long time after programming. As seen by comparing the secondgraph 230 to the first graph 210, the voltage distributions change intime due to the slow charge loss, which results in drifting values ofthe threshold voltage levels (shown by dashed vertical lines). Invarious embodiments, this temporal voltage shift (TVS) is selectivelytracked for programmed pages or blocks grouped by block families, andappropriate voltage offsets, which are based on page or blockaffiliation with a certain block family, are applied to the base readlevels in order to perform read operations.

FIG. 3 is an example graph 300 illustrating the dependency of athreshold voltage offset 310 on the time after program 320, e.g., theperiod of time elapsed since a page had been programmed, in accordancewith some embodiments. As schematically illustrated by FIG. 3, page orblocks (or groups of memory cells at another granularity) of the memorydevice are grouped into block families 330A-330N, such that each blockfamily includes one or more pages or blocks that have been programmedwithin a specified time window, potentially varied by averagetemperature while the block family is open. As noted herein above, sincethe time elapsed after programming and temperature are the main factorsaffecting the temporal voltage shift, all pages, blocks, and/orpartitions within a single block family are presumed to exhibit similardistributions of threshold voltages in memory cells, and thus wouldrequire the same voltage offsets for read operations as time passes.

Block families can be created asynchronously with respect to pageprogramming events. In an illustrative example, the memory sub-systemcontroller 115 of FIG. 1 can create a new block family whenever aspecified period of time (e.g., a predetermined number of minutes) haselapsed since creation of the last block family, which time period canvary significantly depending on an average temperature associated withpages during programming. More specifically, the entire asymptotic curveillustrated in FIG. 3 can be shifted to have a steeper curve withrespect to time as average temperature increases.

A newly created block family can be associated with bin 0, and eachsubsequently created block family can be associated with a sequentiallynumbered block family. Then, the memory sub-system controller canperiodically perform a calibration process in order to associate eachdie of every block family with one of the predefined threshold voltageoffset bins (e.g., bins 0-7 in the illustrative example of FIG. 3),which is in turn associated with the threshold voltage offsets to beapplied for read operations. The association of pages, blocks, and/orpartitions with block families and block families and dice withthreshold voltage offset bins can be stored in respective metadatatables maintained by the memory sub-system controller 115.

FIG. 4 is a graph that illustrates a set of predefined threshold voltageoffset bins (bin 0 to bin 9), in accordance with some embodiments. Asschematically illustrated by FIG. 4, the threshold voltage offset graphcan be subdivided into multiple threshold voltage offset bins, such thateach bin corresponds to a predetermined range of threshold voltageoffsets. While the illustrative example of FIG. 4 defines ten bins, inother implementations, various other numbers of bins can be employed(e.g., 16, 32, 64 bins). Based on a periodically performed calibrationprocess, the memory sub-system controller 115 can associate each die ofevery block family with a threshold voltage offset bin, which defines aset of threshold voltage offsets to be applied to the base voltage readlevel in order to perform read operations.

FIG. 5 is a block diagram that illustrates operation of the block familymanager 113 within the memory sub-system controller 115 of FIG. 1 inaccordance with various embodiments. The memory sub-system can include atimer 512, which can be located in the controller 115, such as withinthe processor 117 or the block family manager 113 in differentembodiments. The memory device 130 can include multiple dice 132,including a first die 132A, a second die 132B, . . . to include an Nthdie 132N. The block family manager 113 can include a partitioner 514,which is adapted to partition sets of pages (like superblocks) into setsof partitions before programming the sets of pages to the multiple dice132 of the memory device 130. The local memory 119 can store a number ofdifferent items of information or data that will be discussed in moredetail, including but not limited to, a block family (BF) start time522, an active block family (BF) identifier 528, a partition queue 534,cursors 538 associated with the memory device 130, and a set of metadatatables 550. This information and data can be flushed to the memorydevice 130 (or other non-volatile memory) in response to detection of animminent loss of power.

In various embodiments, logical address information (e.g., LBA,namespace) can be part of metadata for the host data. Metadata can alsoinclude error handling data (e.g., ECC codeword, parity code), dataversion (e.g., used to distinguish age of data written), valid bitmap(which LBAs or logical transfer units contain valid data), block familyinformation, and the like. Additional metadata can be further associatedwith block families that include partitioning information as will bediscussed with reference to the metadata tables 550.

In various embodiments, the block family manager 113 can open a newblock family after a previously opened block family has been closed. Atinitiation of each block family, the block family manager 113 caninitialize the timer 512 associated with a system clock. The systemclock, for example, can be a clock maintained by the memory sub-system110 and/or the host system 120. The time at which the block family isopened on the system clock can be stored as the BF start time 522. Thevalue of the timer 512 can then track time after program (TAP) for theset of pages that are partitioned into a set of partitions. The blockfamily manager 113 can further, using one or more of the temperaturesensor(s), measure an opening temperature of the memory device 130. Thisopening temperature can be stored in the local memory 119, such as withvalues of the temperature metrics. A change in temperature or anaggregation of temperature change can be tracked over time andincorporated into algorithmic determination of whether some partitionsshould be associated with different threshold voltage offset bins. Thisdetermination can be combined with TAP to determine how long to keep ablock family open.

The block family currently being programmed can be referred to as theactive block family for which the active BF identifier 528 can be storedin the local memory 119 and utilized as the index for the metadatatables 550. For ease of tracking, each subsequently programmed blockfamily can be assigned a sequentially numbered BF identifier, but othersequences and identifiers can also be used. Similarly, each partition ofthe set of partitions created may be assigned a sequentially numberedpartition number. The blocks families can also be associated with one ormore of the cursors 538, e.g., at least an opening cursor and a closingcursor for each BF. “Cursor” herein shall broadly refer to a location onthe memory device to which the data is being written.

In various embodiments, the partitioner 514 is adapted to partition setsof pages in sets of partitions as each set of pages is programmed to themultiple dice 132 of the memory device 130. As discussed, each set ofpages may be a superblock, a group of blocks, a group of superpages, orsome other granularity of trackable memory units programmed to themultiple dice 132. The partitioner 514 can further limit the number oflogical units (LUN) or other trackable memory unit for each partition,e.g., to 18, 20, 24, 32, or the like number of pages. In this way, theTAP and variation in temperature is lessened for each partition betweenstarting to program the partition and ending programming the partition.Further, each partition can be associated with the same or a differentblock family and the same or a different threshold voltage offset bin,thus providing more granular assignment of a partition to a set ofthreshold voltage offset values to be applied to a base read level whenperforming a read operation.

In some embodiments, a data state metric that can be measured at thememory cells of the set of pages can aid in defining a size of eachpartition. A data state metric, such as temporal voltage shift (TVS),can be a quantity that is measured or inferred from the behavior of datawithin the memory cells of the block family that provides insight intothe voltage state of the data. Thus, the data state metric can indicatethe state of TVS, a valley location of a fifth voltage leveldistribution, a median voltage at a seventh voltage level distribution,a degree of read disturb, the number of error bits measured in responseto a read operation at a particular read level, or the like value.Reference to the TVS (or data state metric) value along with TAP, changein temperature, and/or program erase cycles can specify how large eachpartition should be to keep RBER of assigned threshold voltage offsetvalues below an acceptable threshold RBER level. Accordingly, the blockfamily manager 113 can determine a data state metric valuerepresentative of the set of pages being partitioned. The block familymanager can further set a length (or size) of each partition of the setof partitions such as to keep RBER level associated with the data statemetric value below a threshold RBER value.

In some embodiments, however, if the cursor controlled by the controller115 does not finish writing a partition within a threshold allowed time(e.g., associated with filling a partition of a fixed or variable size),the controller 115 can pad a remaining portion of the partition withdummy data such as a randomized pattern data or other dummy data. Thus,in response to determining that at least a specified period of timeelapses before a partition of the set of partitions has been fullyprogrammed, the controller 115 can write the randomized pattern data tofully program the partition and associate the partition with a blockfamily.

FIG. 6 is a graph 600 that schematically illustrates metadata maintainedby the memory sub-system controller 115 operating in according with someembodiments. The metadata can be maintained for associating LUNs (e.g.,blocks) or partial LUNs (e.g., codewords or pages) with partitions andblock families. As schematically illustrated by FIG. 6, the memorysub-system controller 115 can maintain a superblock table 610, a blockfamily table 620, and a bin offset table 630 of the metadata tables 550.Each record of the superblock table 610 specifies the block familyassociated with the specified superblock and partition combination. Insome implementations, records of the superblock table 610 can furtherinclude time and temperature values associated with the specifiedsuperblock and partition combination.

In disclosed embodiments, each record also includes a “Last Valid Page”field that can store a value indicating, to the controller 115, whetherthe partition is fixed length or variable length. If the last valid pagefield is empty (e.g., no value is stored), the associated set of pagesis not partitioned. Further, the partition is fixed length if the lastvalid page value is less than a threshold value (such as eighth, nine,ten, fifteen, or the like) and thus a smaller value that can beassociated with a fixed length. For example, a “0” can be a length of 18superpages, a “10” can be a length of 20 superpages, a “11” can be alength of 24 superpages, a “110” can be a length of 28 superpages, and a“111” can be a length of 32 superpages, or the like. In an alternativeembodiment, the size of the fixed length is stored as a value outside ofthe superblock table 610, e.g., elsewhere in the local memory 119.

In these embodiments, the partition is variable length if the last validpage value is greater than or equal to the threshold value justdiscussed, and the controller 115 tags the variable-length partition bystoring the address for the last valid page in the last valid page fieldof the record. This means that the controller 115 can read the lastvalid page as the last page of the variable-length partition. Knowingthe address of the last valid page helps the controller 115 (or blockfamily manager 113) to determine, based on a logical block address (LBA)in a read operation and the original cursor value for the set of pages,to which variable-length partition the LBA is pointing. Alternatively,the controller 115 can calculate the size of the variable-lengthpartition based on the difference between the last valid page address oftwo sequentially-written partitions. Once a set of pages (e.g.,superblock or other granularity of set of pages) is identified, thepartition is identified, and time and temperature values accounted for,the superblock table 610 can be used to identify the block family withwhich the superblock/partition is associated. The block family is in thelast field of the record in the example superblock table 610 of FIG. 6.

In an alternative embodiment, instead of the address of the last validpage, the controller can store, in the last valid page field of thesuperblock table 610, the size of the variable-length partition. Theparticular partition can then be calculated based on the lengths (orsizes) of respective partitions that are stored sequentially to thememory device 130 from the cursor location. For cursors that do not useall of the maximum number of variable-length partitions, the controller115 can store the number of partitions used and only perform the binarysearch (e.g., searching) for a variable-length partition within thevalid variable-length partitions.

In various embodiments, memory constraints, including the allocation ofmemory for the superblock table 610 that tracks partitions, suggest aselective approach to partitioning sets of pages. For example, thedisclosed system and methods can further identify a subset of the setsof pages experiencing a variation in a data state metric (such as TVS)that satisfies a threshold criterion. This identification of the subsetcan be based on those of the sets of pages that take more than athreshold time period to completely program, thus resulting in avariation in a value measured for the data state metric over thethreshold criterion. In various embodiments, this threshold criteriondetermination is made based on workload, memory operation scheduling,and/or amount of data projected to be written to a given set of pages.The system and method can, in this way, partition just the sets of pagesthat qualify instead of partitioning each of the sets of pages beingprogrammed to the multiple dice 132.

In one embodiment, with additional reference to FIG. 5, the partitioner514 partitions each set of pages (such as a superblock) of the subsetinto a set number of fixed-length partitions, where each partition is anumbered portion of the set of pages. The partitioner 514 further storesat least one bit value in one of the metadata tables 550 (e.g., thesuperblock table 610) indicative of a fixed length. For example, the bitvalue can be a “0” or a “1” or the like associated with the partition(or in association with the first partition of the set of pages) thatindicates that the partitioner 514 should use a default size for eachpartition. That default size could change with different values of theat least one bit, as was discussed above. With additional reference toFIG. 6, the at least one bit is a “1” for superblock 0 in the last validpage column of a superblock table 610, by way of example.

Then, when receiving a read operation directed at a page of the set ofpages (e.g., superblock) that was partitioned with a fixed-lengthpartition, the controller 115 (or block family manager 113) candetermine, based on a logical block address specified by the readoperation and the value indicative of the fixed length, a partition ofthe set of partitions to which the read operation corresponds. In theexample illustrated in FIG. 6, the address is to a page or block ofsuperblock 0. Knowing the fixed size of the partitions (e.g., thatcorresponds to a “1” value), a mathematical calculation leads todetermining the partition associated with the page or block of theaddress (e.g., LBA) within superblock 0. In the example of FIG. 6, thepartition is resolved to be partition “0.” The controller 115 canfurther perform searching, using a first value associated with thesuperblock (e.g., “0” in this case) and a second value associated withthe partition (e.g., assume also “0” in this case), the superblock table610 to identify a block family (e.g., block family “4”) to which thepartition is assigned.

In another embodiment, with additional reference to FIG. 5, thepartitioner 514 partitions the set of pages (such as a superblock) intoa maximum number of variable-length partitions, where eachvariable-length partition is a numbered portion of the set of pages. Thepartitioner 514 further stores in one of the metadata tables 550 (e.g.,the superblock table 610) an address of the last valid page that waswritten for each numbered portion of the set of pages. Thus, by way ofexample, when programming superblock 1, the superblock table 610illustrates that each partition 0 through 31 of superblock 1 has adifferent number offset (although some can be the same or similar toeach other), e.g., address 18 for partition 0, address 37 for partition1, address 56 for partition 2, address 77 for partition 3, and so forth.

In this variable-length embodiment, when receiving a read operationdirected at a page of the set of pages (e.g., superblock) that waspartitioned, the controller 115 (or block family manager 113) can searchthrough the multiple last valid pages of the metadata table 550 (e.g.,the superblock table 610) to determine a partition of the set ofpartitions corresponding to a logical block address of the readoperation. For example, if the LBA corresponds to superblock and the LBAresolves to a last valid page of 18, then the superblock table 610returns a partition number of 0. The controller 115 can further search,using a first value associated with the superblock and a second valueassociated with the partition, the metadata table (e.g., the superblocktable 610) to identify a block family to which the partition isassigned. The block family identified in the example of FIG. 6 is blockfamily 20.

In related embodiments, the partitioner 514 can track time after program(TAP) for the partitioned sets of pages or superblocks. For example,only the most recently written pages remain partitioned. Once a set ofpages has reached a threshold TAP (e.g., 18 hours, 20 hours, 22 hour orthe like), the partitioning of the set of pages can be removed so thatall pages of the set of pages are again treated equally for purposes ofassignment to a threshold voltage offset bin and/or to threshold voltageoffset values. The threshold TAP can be set generally at the TAP wherethe TVS levels out for the die(s). The partitioner 514 can removepartitioning by, for example, removing the at least one bit (or bitvalue) from the metadata table 550 for the set of pages in response tothe set of pages reaching a threshold time after program (TAP). Removingthese value(s) signals to the processing logic of the partitioner 514thereafter that the set of pages is no longer partitioned. The removedinformation could be a bit value that indicates the partitions are fixedin length or the address of the last valid page stored for thepartitions that are variable in length, for example. The partitioner 514can further remove other metadata that tracks per-partition allocationto the threshold voltage offset bins.

In an alternative embodiment, the partitioning is removed in response tothe set of pages exiting the partition queue 534 of a threshold numberof the sets of pages that are to remain partitioned. The partition queue534 could therefore be a first-in-first-out (FIFO) or similar queue thattracks just a threshold number of the sets of pages, e.g., 10, 15, 20,or the like sets of pages. This threshold number of the sets of pagescan be chosen based on an estimation that sets of pages exiting thepartition queue 534 have met the threshold TAP discussed previously.When an identifier of a set of pages exits the partition queue 534, thepartitioner 514 can remove any partition-indicating values stored in therecord of the superblock table 610 for that set of pages indexed withinthe metadata tables 550. In these ways, the partitioner 514 candetermine when partitions of a partitioned set of pages have TVS orother data state metric calibrations that are substantially similar andare no longer needed to be partitioned. The partitioner 514 can alsoremove indications of partitioning from the metadata in the superblocktable 610.

In various embodiments, removing partitioning (or merging partitions ofa set of pages) can result in the partitioner 514 choosing the sameblock family for the merged set of pages. In one embodiment, the blockfamily manager 113 selects an existing block family associated with thepreviously partitioned sets of pages. In one example, the block familyis the oldest block family previously assigned any one of thepartitions, but can be a middle-aged block family in terms of TAP, orsome different block family assignment best representative of thresholdvoltage shift (TVS) for the merged set of pages. The partitioner 514 canthen update the superblock table 610, for example, to consolidate asingle entry for the merged set of pages. The single entry is associatedwith a block family, for example, in the value of the last column of theentry. The entry for superblock 3 in FIG. 6 is an example, e.g., whichassociated with block family 21. The entry contains a pointer to Index21 associated with block family 21.

In further embodiments, the partitioner 514 partitions the set of pages(e.g., superblock) into the set of partitions that includes a variablenumber of fixed-length and variable-length partitions. The partitioner514 can further store a value identifying each variable-length partitionin an array with a multiple-linked list structure of tracking thevariable-length partitions. The fixed-length partitions will bepredictably tracked within or on either side of variable-lengthpartitions by way of knowing the size of each fixed-length partition.

Furthermore, a threshold voltage offset calculator of the block familymanager 113 can access the metadata tables 550 to determine whichthreshold voltage offset bin should be used for a particular read. Asdiscussed with reference to FIGS. 3-4, as the TVS value for a BF shiftswith increasing slow charge loss, the BF will be read with reference tobins with larger voltage offset values. These larger voltage offsetvalues can come from higher-numbered bins, for example.

With additional reference to FIG. 6, the block family table 620 isindexed by the block family number (or a block family identifier), suchthat each record of the block family table 620 specifies, for the blockfamily referenced by the index of the record in the superblock table610, a set of threshold voltage offset bins (e.g., bin pointers)associated with respective dice of the block family. In other words,each record of the block family table 620 includes a vector, eachelement of which specifies the threshold voltage offset bin associatedwith the die referenced by the index of the vector element. In oneembodiment, all the dice of multiple dice 132 in the memory device 130point to a single bin. The threshold voltage offset bins to beassociated with the block family dice can be determined by thecalibration process, as described in more detail herein. Further, thebin offset table 630 is indexed by the bin number. Each record of thebin offset table 630 specifies a set of threshold voltage offsets (e.g.,for TLC, MLC, and/or SLC) associated with threshold voltage offset bin.

The metadata tables 610-630 can be stored on one or more memory devices130 of FIG. 1. In some implementations, at least part of the metadatatables 610-630 can be cached in the local memory 119 of the memorysub-system controller 115 of FIG. 1, e.g., as part of the metadatatables 550 (FIG. 5).

In operation, upon receiving a read command, the memory sub-systemcontroller determines the physical address corresponding to the logicalblock address (LBA) specified by the read command. Components of thephysical address, such as the physical block number and the dieidentifier, are utilized for performing the metadata table walk. Forexample, the superblock table 610 is first used to identify the blockfamily identifier corresponding to the physical block number, as wasdiscussed above. Next, the block family identifier is used as the indexto the block family table 620 in order to determine the thresholdvoltage offset bin associated with the block family and the die.Finally, the identified threshold voltage offset bin is used as theindex to the bin offset table 630 in order to determine one or morethreshold voltage offsets corresponding to the identified thresholdvoltage offset bin. The memory sub-system controller 115 can thenadditively apply the identified threshold voltage offset to the basevoltage read level for each voltage level read distribution in order toperform the requested read operation.

In the illustrative example of FIG. 6, the superblock table 610 mapspartition 0 of the superblock 0 to block family 4, which is utilized asthe index to the block family table 620 in order to determine that, forblock family 4, die 0 is mapped to bin 3. The latter value is used asthe index to the bin offset table 630 in order to determine thethreshold voltage offset values for bin 3. This was the above example ofthe fixed-length partition.

In a further illustrative example of FIG. 6, the superblock table 610maps partition 0 of superblock 1 to block family 20, which is utilizedas the index to the block family table 620 in order to determine that,for block family 20, die 0 is mapped to bin 22. The latter value is usedas the index to the bin offset table 630 in order to determine thethreshold voltage offset values for bin 22. This was the above exampleof the fixed-length partition. Not all values likely contained in themetadata tables 610-630 are illustrated for simplified illustration.

FIG. 7 is a flow diagram of an example method 700 for selectivepartitioning of sets of pages programmed to a memory device, inaccordance with some embodiments. The method 700 can be performed byprocessing logic that can include hardware (e.g., processing device,circuitry, dedicated logic, programmable logic, microcode, hardware of adevice, integrated circuit, etc.), software (e.g., instructions run orexecuted on a processing device), or a combination thereof. In someembodiments, the method 700 is performed by the block family manager 113of FIG. 1. Although shown in a particular sequence or order, unlessotherwise specified, the order of the operations can be modified. Thus,the illustrated embodiments should be understood only as examples, andthe illustrated operations can be performed in a different order, whilesome operations can be performed in parallel. Additionally, one or moreoperations can be omitted in some embodiments. Thus, not all illustratedoperations are required in every embodiment, and other process flows arepossible.

At operation 705, the processing logic receives a memory operation toprogram a set of pages of data across at least a subset of the multipledice 132 of the memory device 130. The memory operation can be a writeoperation. In one embodiment, the multiple dice 132 are all of the diceof the memory device 130.

At operation 710, the processing logic identifies a subset (e.g., aplurality) of the sets of pages experiencing a variation in a data statemetric satisfying a threshold criterion. This identifying can includedetermining that the subset of the sets of pages takes more than athreshold time period to completely program. The data state metric canbe a quantity that is measured or inferred from the behavior of datawithin the memory cells of the block family that provides insight intothe voltage state of the data. Thus, the data state metric can indicatethe state of TVS, a 5^(th) valley location, a 7^(th) distribution medianvoltage, a degree of read disturb, the number of error bits measuredusing a particular read level, or the like value.

At operation 715, the processing logic partitions a first set of pagesof the subset of the sets of pages into a set of partitions. Atoperation 720, the processing logic programs the set of partitions tothe multiple dice 132.

At operation 725, the processing logic stores, in a metadata table 550,at least one bit to indicate that the set of pages is partitioned. Inone embodiment, the metadata table 550 is the superblock table 610. Fora set of fixed-length partitions, the at least one bit can have a valuethat is below a threshold value and thus indicative of referencing afixed length. In another embodiment, for a set of variable-lengthpartitions, the at least one bit can have a value that is greater thanor equal to the threshold value and thus indicative of referencing avariable length.

Once the set of pages is partitioned, the processing logic can furtherassociate a first partition of the set of partitions with a first blockfamily and assign the first block family to a first threshold voltageoffset bin. The processing logic can further associate a subsequentpartition of the set of partitions with a second block family and assignthe second block family to a second threshold voltage offset bin. Inthis way, each more granular partition of the set of pages is separatelyassignment to a different threshold voltage offset bin, and thus adifferent set of threshold voltage offset values. In an extension of themethod 700, the processing logic can further partition, into a furtherset of partitions, each set of pages of the subset of the sets of pagesin addition to the first set of pages and further program each furtherset of partitions to the multiple dice 132.

FIG. 8 is a flow diagram of an example method 800 for selectivepartitioning of sets of pages programmed to a memory device, inaccordance with another embodiment. The method 800 can be performed byprocessing logic that can include hardware (e.g., processing device,circuitry, dedicated logic, programmable logic, microcode, hardware of adevice, integrated circuit, etc.), software (e.g., instructions run orexecuted on a processing device), or a combination thereof. In someembodiments, the method 800 is performed by the block family manager 113of FIG. 1. Although shown in a particular sequence or order, unlessotherwise specified, the order of the operations can be modified. Thus,the illustrated embodiments should be understood only as examples, andthe illustrated operations can be performed in a different order, whilesome operations can be performed in parallel. Additionally, one or moreoperations can be omitted in some embodiments. Thus, not all illustratedoperations are required in every embodiment, and other process flows arepossible.

At operation 805, the processing logic receives a memory operation toprogram a set of pages of data across at least a subset of the multipledice 132 of the memory device 130. The memory operation can be a writeoperation. In one embodiment, the multiple dice 132 are all of the diceof the memory device 130.

At operation 810, the processing logic identifies a subset (e.g., aplurality) of the sets of pages experiencing a variation in temporalvoltage shift (TVS) satisfying a threshold criterion. This identifyingcan include determining that the subset of the sets of pages takes morethan a threshold time period to completely program, e.g., over 1 hour, 2hours, 3 hours, or some other fixed number of hours of half hours. Thelonger it takes to program a set of pages, the more likely the variationin TVS will be unacceptably large.

At operation 815, the processing logic partitions a first set of pagesof the subset of the set of pages into a set of fixed-length partitions,wherein each fixed-length partition is a numbered sub-group of the setof pages. At operation 820, the processing logic programs the set offixed-length partitions to the multiple dice 132.

At operation 825, the processing logic stores, in a metadata table 550,a value to indicate a size of each fixed-length partition. In oneembodiment, the metadata table 550 is the superblock table 610. Thevalue can be below a threshold value and thus indicative of referencinga fixed length. In an extension of the method 800, the processing logiccan further partition, into a further set of fixed-length partitions,each set of pages of the subset of the sets of pages in addition to thefirst set of pages and further program each further set of fixed-lengthpartitions to the multiple dice 132.

FIG. 9 is a flow diagram of an example method 900 for selectivepartitioning of sets of pages programmed to a memory device, accordingto a further embodiment. The method 900 can be performed by processinglogic that can include hardware (e.g., processing device, circuitry,dedicated logic, programmable logic, microcode, hardware of a device,integrated circuit, etc.), software (e.g., instructions run or executedon a processing device), or a combination thereof. In some embodiments,the method 900 is performed by the block family manager 113 of FIG. 1.Although shown in a particular sequence or order, unless otherwisespecified, the order of the operations can be modified. Thus, theillustrated embodiments should be understood only as examples, and theillustrated operations can be performed in a different order, while someoperations can be performed in parallel. Additionally, one or moreoperations can be omitted in some embodiments. Thus, not all illustratedoperations are required in every embodiment, and other process flows arepossible.

At operation 905, the processing logic receives a memory operation toprogram a set of pages of data across at least a subset of multiple diceof the memory device. The memory operation can be a write operation. Inone embodiment, the multiple dice 132 are all of the dice of the memorydevice 130.

At operation 910, the processing logic identifies a subset (e.g., aplurality) of the sets of pages that are to undergo a variation intemporal voltage shift satisfying a threshold criterion. Thisidentifying can include determining that the subset of the sets of pagestakes more than a threshold time period to completely program, e.g.,over 1 hour, 2 hours, 3 hours, or some other fixed number of hours ofhalf hours. The longer it takes to program a set of pages, the morelikely the variation in TVS will be unacceptably large.

At operation 915, the processing logic partitions a first set of pagesof the subset of the sets of pages into a set of variable-lengthpartitions, wherein each variable-length partition is a numberedsub-group of the set of pages. At operation 920, the processing logicprograms the set of variable-length partitions to the multiple dice 132.

At operation 925, the processing logic stores, in a metadata table 550,an address of a last valid page that was written for each numberedsub-group of the set of pages. In one embodiment, the metadata table 550is the superblock table 610. The address of the last valid page for eachpartition can be stored in the last valid page field or another field ofthe superblock table. In an extension of the method 900, the processinglogic can further partition, into a further set of variable-lengthpartitions, each set of pages of the subset of the sets of pages inaddition to the first set of pages and further program each further setof partitions to the multiple dice 132.

FIG. 10 is a flow diagram of an example method 1000 for merging apartitioned set of pages according to an embodiment. The method 1000 canbe applicable to merging a set of partitions, whether fixed-length orvariable-length partitions. The method 1000 can be performed byprocessing logic that can include hardware (e.g., processing device,circuitry, dedicated logic, programmable logic, microcode, hardware of adevice, integrated circuit, etc.), software (e.g., instructions run orexecuted on a processing device), or a combination thereof. In someembodiments, the method 1000 is performed by the block family manager113 of FIG. 1. Although shown in a particular sequence or order, unlessotherwise specified, the order of the operations can be modified. Thus,the illustrated embodiments should be understood only as examples, andthe illustrated operations can be performed in a different order, whilesome operations can be performed in parallel. Additionally, one or moreoperations can be omitted in some embodiments. Thus, not all illustratedoperations are required in every embodiment, and other process flows arepossible.

At operation 1010, the processing logic determines whether the set ofpages (or set of partitions of the set of pages) has reached a criteriafor merging the set of partitions. These criteria have been discussed,and include, for example, the set of pages reaching a threshold TAP, anidentifier for the set of pages has exited a queue that holds athreshold number of the sets of pages that are to remain partitioned, orthe set of partitions are assigned to an identical threshold voltageoffset bin. Any one of these criteria indicate that the value ofseparately assigning a threshold voltage offset bin to differentpartitions of the set of pages is diminished to the point that trackingindividual partitions within metadata no longer has merit. Additionalcriteria are envisioned that can involve, for example, tracking ormeasuring TVS values of the partitions.

At operation 1020, the processing logic removes one or more bit value(s)from the metadata table (e.g., the superblock table 610) thatindicate(s) the set of pages is partitioned. In this way, the metadatatable will no longer signal to the processing logic that the set ofpages is partitioned.

At operation 1030, the processing logic merges the set of partitionsinto a merged set of pages. In one embodiment, this merging returns theset of partitions to being tracked as an individual memory unit, such asa superblock in the example of FIG. 6.

At operation 1040, the selecting a block family for the merged set ofpages. In one embodiment, the selected block family is the oldest blockfamily (having the largest TAP) previously assigned any one of thepartitions for the set of pages. In another embodiment, a block familythat is of median age is selected as most representative for purposes ofassociation with a threshold voltage offset bin. Other algorithmicapproaches such as averaging TAP, for example, are envisioned that alsoresult in association of the merged set of pages with a block familythat was or was not previously assigned to one or more of thepartitions.

At operation 1050, the processing logic consolidates, within themetadata table, a single entry for the merged set of pages. The singleentry is associated with the selected block family, such as by way of avalue stored within the record for the merged set of pages illustratedin superblock table 610 of FIG. 6. In this way, the remaining entry inthe metadata table after merging the partitions is already associatedwith the block family and has an appropriate pointer into the blockfamily table 620 that assigns the threshold voltage offset bin and dienumber to the entry.

FIG. 11 illustrates an example machine of a computer system 1100 withinwhich a set of instructions, for causing the machine to perform any oneor more of the methodologies discussed herein, can be executed. In someembodiments, the computer system 1100 can correspond to a host system(e.g., the host system 120 of FIG. 1) that includes, is coupled to, orutilizes a memory sub-system (e.g., the memory sub-system 110 of FIG. 1)or can be used to perform the operations of a controller (e.g., toexecute an operating system to perform operations corresponding to theblock family manager 113 of FIG. 1). In alternative embodiments, themachine can be connected (e.g., networked) to other machines in a LAN,an intranet, an extranet, and/or the Internet. The machine can operatein the capacity of a server or a client machine in client-server networkenvironment, as a peer machine in a peer-to-peer (or distributed)network environment, or as a server or a client machine in a cloudcomputing infrastructure or environment.

The machine can be a personal computer (PC), a tablet PC, a set-top box(STB), a Personal Digital Assistant (PDA), a cellular telephone, a webappliance, a server, a network router, a switch or bridge, or anymachine capable of executing a set of instructions (sequential orotherwise) that specify actions to be taken by that machine. Further,while a single machine is illustrated, the term “machine” shall also betaken to include any collection of machines that individually or jointlyexecute a set (or multiple sets) of instructions to perform any one ormore of the methodologies discussed herein.

The example computer system 1100 includes a processing device 1102, amain memory 1104 (e.g., read-only memory (ROM), flash memory, dynamicrandom access memory (DRAM) such as synchronous DRAM (SDRAM) or RambusDRAM (RDRAM), etc.), a static memory 1110 (e.g., flash memory, staticrandom access memory (SRAM), etc.), and a data storage system 1118,which communicate with each other via a bus 1130.

Processing device 1102 represents one or more general-purpose processingdevices such as a microprocessor, a central processing unit, or thelike. More particularly, the processing device can be a complexinstruction set computing (CISC) microprocessor, reduced instruction setcomputing (RISC) microprocessor, very long instruction word (VLIW)microprocessor, or a processor implementing other instruction sets, orprocessors implementing a combination of instruction sets. Processingdevice 1102 can also be one or more special-purpose processing devicessuch as an application specific integrated circuit (ASIC), a fieldprogrammable gate array (FPGA), a digital signal processor (DSP),network processor, or the like. The processing device 1102 is configuredto execute instructions 1128 for performing the operations and stepsdiscussed herein. The computer system 1100 can further include a networkinterface device 1112 to communicate over the network 1120.

The data storage system 1118 can include a machine-readable storagemedium 1124 (also known as a computer-readable medium) on which isstored one or more sets of instructions 1128 or software embodying anyone or more of the methodologies or functions described herein. Theinstructions 1128 can also reside, completely or at least partially,within the main memory 1104 and/or within the processing device 1102during execution thereof by the computer system 1100, the main memory1104 and the processing device 1102 also constituting machine-readablestorage media. The machine-readable storage medium 1124, data storagesystem 1118, and/or main memory 1104 can correspond to the memorysub-system 110 of FIG. 1.

In one embodiment, the instructions 1128 include instructions toimplement functionality corresponding to the block family manager 113 ofFIG. 1. While the machine-readable storage medium 1124 is shown in anexample embodiment to be a single medium, the term “machine-readablestorage medium” should be taken to include a single medium or multiplemedia that store the one or more sets of instructions. The term“machine-readable storage medium” shall also be taken to include anymedium that is capable of storing or encoding a set of instructions forexecution by the machine and that cause the machine to perform any oneor more of the methodologies of the present disclosure. The term“machine-readable storage medium” shall accordingly be taken to include,but not be limited to, solid-state memories, optical media, and magneticmedia.

Some portions of the preceding detailed descriptions have been presentedin terms of algorithms and symbolic representations of operations ondata bits within a computer memory. These algorithmic descriptions andrepresentations are the ways used by those skilled in the dataprocessing arts to most effectively convey the substance of their workto others skilled in the art. An algorithm is here, and generally,conceived to be a self-consistent sequence of operations leading to adesired result. The operations are those requiring physicalmanipulations of physical quantities. Usually, though not necessarily,these quantities take the form of electrical or magnetic signals capableof being stored, combined, compared, and otherwise manipulated. It hasproven convenient at times, principally for reasons of common usage, torefer to these signals as bits, values, elements, symbols, characters,terms, numbers, or the like.

It should be borne in mind, however, that all of these and similar termsare to be associated with the appropriate physical quantities and aremerely convenient labels applied to these quantities. The presentdisclosure can refer to the action and processes of a computer system,or similar electronic computing device, that manipulates and transformsdata represented as physical (electronic) quantities within the computersystem's registers and memories into other data similarly represented asphysical quantities within the computer system memories or registers orother such information storage systems.

The present disclosure also relates to an apparatus for performing theoperations herein. This apparatus can be specially constructed for theintended purposes, or it can include a general purpose computerselectively activated or reconfigured by a computer program stored inthe computer. Such a computer program can be stored in a computerreadable storage medium, such as, but not limited to, any type of diskincluding floppy disks, optical disks, CD-ROMs, and magnetic-opticaldisks, read-only memories (ROMs), random access memories (RAMs), EPROMs,EEPROMs, magnetic or optical cards, or any type of media suitable forstoring electronic instructions, each coupled to a computer system bus.

The algorithms and displays presented herein are not inherently relatedto any particular computer or other apparatus. Various general purposesystems can be used with programs in accordance with the teachingsherein, or it can prove convenient to construct a more specializedapparatus to perform the method. The structure for a variety of thesesystems will appear as set forth in the description below. In addition,the present disclosure is not described with reference to any particularprogramming language. It will be appreciated that a variety ofprogramming languages can be used to implement the teachings of thedisclosure as described herein.

The present disclosure can be provided as a computer program product, orsoftware, that can include a machine-readable medium having storedthereon instructions, which can be used to program a computer system (orother electronic devices) to perform a process according to the presentdisclosure. A machine-readable medium includes any mechanism for storinginformation in a form readable by a machine (e.g., a computer). In someembodiments, a machine-readable (e.g., computer-readable) mediumincludes a machine (e.g., a computer) readable storage medium such as aread only memory (“ROM”), random access memory (“RAM”), magnetic diskstorage media, optical storage media, flash memory devices, etc.

In the foregoing specification, embodiments of the disclosure have beendescribed with reference to specific example embodiments thereof. Itwill be evident that various modifications can be made thereto withoutdeparting from the broader spirit and scope of embodiments of thedisclosure as set forth in the following claims. The specification anddrawings are, accordingly, to be regarded in an illustrative senserather than a restrictive sense.

What is claimed is:
 1. A system comprising: a memory device comprising aplurality of dice; and a processing device, operatively coupled to thememory device, the processing device to perform operations, comprising:receiving memory operations to program sets of pages of data across atleast a subset of the plurality of dice; identifying, while programmingthe sets of pages to the plurality of dice, a plurality of the sets ofpages experiencing a variation in a data state metric satisfying athreshold criterion; partitioning, into a set of partitions, a set ofpages of the plurality of the sets of pages; storing, in a metadatatable, at least one bit to indicate that the set of pages ispartitioned; and wherein, for each set of pages of the plurality of thesets of pages: removing the at least one bit from the metadata table forthe set of pages in response to the set of pages reaching a thresholdtime after program (TAP); merging the set of partitions into a mergedset of pages; selecting a block family for the merged set of pages; andconsolidating, within the metadata table, a single entry for the mergedset of pages, wherein the single entry is associated with the blockfamily.
 2. The system of claim 1, wherein the identifying furthercomprises determining that the plurality of the sets of pages takes morethan a threshold time period to completely program, wherein theoperations further comprise: partitioning, into a further set ofpartitions, each set of pages of the plurality of the sets of pages inaddition to the set of pages; and programming each further set ofpartitions to the plurality of dice.
 3. The system of claim 1, wherein,for each set of pages of the plurality of the sets of pages, eachpartition of the set of partitions is of a fixed length, and wherein theoperations further comprise storing, in the metadata table, a valueindicative of the fixed length.
 4. The system of claim 3, wherein theoperations further comprise: receiving a read operation directed at apage of the set of pages; determining, based on a logical block addressof the read operation and on the value indicative of the fixed length, apartition of the set of partitions to which the read operationcorresponds; and searching, using a first value associated with the setof pages and a second value associated with the partition, the metadatatable to identify a block family to which the partition is assigned. 5.The system of claim 1, wherein each partition is a numbered portion ofthe set of pages, the set of partitions comprises a maximum number ofvariable-length partitions, and the operations further comprise storing,in the metadata table in association with the set of pages, an addressof a last valid page that was written for each numbered portion of theset of pages.
 6. The system of claim 5, wherein the operations furthercomprise: receiving a read operation directed at a page of the set ofpages; searching through a plurality of last valid pages of the metadatatable to determine a partition of the set of partitions corresponding toa logical block address of the read operation; and searching, using afirst value associated with the set of pages and a second valueassociated with the partition, the metadata table to identify a blockfamily to which the partition is assigned.
 7. The system of claim 1,wherein, for each set of pages of the plurality of the sets of pages,the set of partitions comprises a variable number of fixed-length andvariable-length partitions, and wherein the operations further comprisestoring a value identifying each variable-length partition in an arraywith a multiple-linked list structure of tracking the variable-lengthpartitions.
 8. A method comprising: receiving, by a memory sub-system ofa memory device, memory operations to program sets of pages of dataacross at least a subset of a plurality of dice; identifying, by aprocessing device of the memory sub-system and while programming thesets of pages to the plurality of dice, a plurality of the sets of pagesexperiencing a variation in temporal voltage shift satisfying athreshold criterion; partitioning, by the processing device, a set ofpages of the plurality of the sets of pages into a set of fixed-lengthpartitions, wherein each fixed-length partition is a numbered sub-groupof the set of pages; storing, by the processing device in a metadatatable, a value to indicate a size of each fixed-length partition, andwherein, for each set of pages of the plurality of the sets of pages:removing the value from the metadata table for the set of pages inresponse to the set of fixed-length partitions being assigned to anidentical threshold voltage offset bin; merging the set of fixed-lengthpartitions into a merged set of pages; selecting a block family for themerged set of pages; and consolidating, within the metadata table, asingle entry for the merged set of pages, wherein the single entry isassociated with the block family.
 9. The method of claim 8, wherein theidentifying further comprises determining that the plurality of the setsof pages takes more than a threshold time period to completely program,the method further comprising: partitioning, into a further set ofpartitions, each set of pages of the plurality of the sets of pages inaddition to the set of pages; and programming each further set ofpartitions to the plurality of dice.
 10. The method of claim 8, whereinthe method further comprises: receiving a read operation directed at apage of the set of pages; determining, based on a logical block addressof the read operation and on the value that indicates the size of eachfixed-length partition, a partition of the set of fixed-lengthpartitions to which the read operation corresponds; and searching withinthe metadata table to determine a block family to which the partition isassigned, wherein the searching is based on a first value associatedwith the set of pages and a second value associated with the partition.11. The method of claim 10, further comprising: searching a block familytable, using an identifier for the block family, to identify a thresholdvoltage offset bin to which the block family is assigned; searching athreshold voltage offset table using a bin number for the thresholdvoltage offset bin to determine one or more threshold voltage offsetsvalue for use in performing the read operation; and reading data fromthe page via application of the one or more threshold voltage offsetvalue to a base read level.
 12. A method comprising: receiving, by amemory sub-system of a memory device, memory operations to program setsof pages of data across at least a subset of a plurality of dice;identifying, by a processing device of the memory sub-system and whileprogramming the sets of pages to the plurality of dice, a plurality ofthe sets of pages experiencing a variation in temporal voltage shiftsatisfying a threshold criterion; partitioning, by the processingdevice, a set of pages of the plurality of the sets of pages into a setof variable-length partitions, wherein each variable-length partition isa numbered sub-group of the set of pages; storing, by the processingdevice in a metadata table, an address of a last valid page that waswritten for each numbered sub-group of the set of pages; receiving aread operation directed at a page of the set of pages; searching througha plurality of last valid pages of the metadata table to determine apartition of the set of variable-length partitions corresponding to alogical block address of the read operation; and searching within themetadata table to determine a block family to which the partition isassigned, wherein the searching is based on a first value associatedwith the set of pages and a second value associated with the partition.13. The method of claim 12, wherein the identifying further comprisesdetermining that the plurality of the sets of pages takes more than athreshold time period to completely program, the method furthercomprising: partitioning, into a further set of partitions, each set ofpages of the plurality of the sets of pages in addition to the set ofpages; and programming each further set of partitions to the pluralityof dice.
 14. The method of claim 12, wherein, for each set of pages ofthe plurality of the set of pages, the method further comprises:removing the address of the last valid page from the metadata table forthe set of pages in response to the set of pages reaching a thresholdtime after program (TAP); merging the set of variable-length partitionsinto a merged set of pages; selecting a block family for the merged setof pages; and consolidating, within the metadata table, a single entryfor the merged set of pages, wherein the single entry is associated withthe block family.
 15. The method of claim 12, wherein, for each set ofpages of the plurality of the sets of pages, the method furthercomprising: removing the address of the last valid page from themetadata table for the set of variable-length partitions are assigned toan identical threshold voltage offset bin; merging the set ofvariable-length partitions into a merged set of pages; selecting a blockfamily for the merged set of pages; and consolidating, within themetadata table, a single entry for the merged set of pages, wherein thesingle entry is associated with the block family.